Information flow security in dynamic contexts
نویسندگان
چکیده
منابع مشابه
Information Flow Security in Dynamic Contexts
We study information flow security in the setting of mobile agents. We propose a sufficient condition to security named Persistent BNDC. A process is Persistent BNDC when every of its reachable states satisfies a basic Non-Interference property called BNDC. By imposing that security persists during process execution, one is guaranteed that every potential migration is performed in a stable, sec...
متن کاملInformation flow in secure contexts
Information flow security in a multilevel system aims at guaranteeing that no high level information is revealed to low level users, even in the presence of any possible malicious process. This requirement could be stronger than necessary when some knowledge about the environment (context) in which the process is going to run is available. To relax this requirement we introduce the notion of se...
متن کاملInformation flow analysis for mobile code in dynamic security environments
stack: as ∈ Exp∗ Table 5.1 on the preceding page defines the function BC2IRinstr which takes a bytecode address, a bytecode instruction and an abstract input stack, and produces an IR instruction and an abstract output stack. The function reconstructs the high-level expressions from operand-stack manipulating bytecode instructions. The bytecode instructions store x, putf f , newC , and callm ar...
متن کاملDynamic Tracking of Information Flow Signatures for Security Checking
Memory-based attacks represent one of the largest attack classes in the field. Many techniques have been proposed to protect applications from certain classes of memory exploits, however, few of these techniques can protect the application from all memory attacks, and few permit the protection of only select variables. We present a technique to provide protection of select variables from a wide...
متن کاملUnwinding in Information Flow Security
We study information flow security properties which are persistent, in the sense that if a system is secure then all of its reachable states are secure too. We present a uniform characterization of these properties in terms of a general unwinding schema. This unwinding characterization allows us to prove several compositionality properties of the considered security classes. Moreover, we exploi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Security
سال: 2006
ISSN: 1875-8924,0926-227X
DOI: 10.3233/jcs-2006-14103